Polar Lattices for Lossy Compression

نویسندگان

چکیده

In this work, we propose a new construction of polar lattices to achieve the rate-distortion bound memoryless Gaussian source. The structure proposed allows integrate entropy coding into lattice quantizer, which greatly simplifies compression process. overall complexity encoding and decoding is O(N log 2 N) for any target distortion fixed rate larger than bound. Moreover, nesting provides solutions various multi-terminal problems. Wyner-Ziv problem source can be solved by using capacity-achieving channel, nested with achieving lattice, while Gelfand-Pinsker in reversed manner. quantizer further extended extract Wyner's common information pair sources or multiple sources.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lossy Image Compression

Representing image files as simple arrays of pixels is generally very inefficient in terms of memory. Storage space and network bandwidth is limited so it is necessary to compress image files. There are many methods that achieve very high compression ratios by allowing the data to be corrupted in ways that are not easily perceivable to the human eye. A new concept is described, combining fracta...

متن کامل

Topologically Controlled Lossy Compression

This paper presents a new algorithm for the lossy compression of scalar data defined on 2D or 3D regular grids, with topological control. Certain techniques allow users to control the pointwise error induced by the compression. However, in many scenarios it is desirable to control in a similar way the preservation of higher-level notions, such as topological features , in order to provide guara...

متن کامل

Locally Polar Lattices

A lattice 9 is locally polar if each element is a join of points (atoms) and each interval L?$ = (y j x < y}, x a point, is a polar space (see Tits [6] or Buekenhout and Shult [4]). Recall that the rank of a polar space is the maximum projective dimension of an element; since this number is finite, 9 has a 1 and a 0. There is an obvious dimension function on 9, so lines and planes have the obvi...

متن کامل

Polar Codes and Polar Lattices for the Heegard-Berger Problem

Explicit coding schemes are proposed to achieve the rate-distortion function of the Heegard-Berger problem using polar codes. Specifically, a nested polar code construction is employed to achieve the rate-distortion function for the doubly-symmetric binary sources when the side information may be absent. The nested structure contains two optimal polar codes for lossy source coding and channel c...

متن کامل

Maximum Likelihood Estimation for Lossy Data Compression∗

In lossless data compression, given a sequence of observations (Xn)n≥1 and a family of probability distributions {Qθ}θ∈Θ, the estimators (θ̃n)n≥1 obtained by minimizing the ideal Shannon code-lengths over the family {Qθ}θ∈Θ, θ̃n := arg min θ∈Θ [ − logQθ(X 1 ) ] , whereXn 1 := (X1, X2, . . . , Xn), coincide with the classical maximum-likelihood estimators (MLEs). In the corresponding lossy compres...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2021

ISSN: ['0018-9448', '1557-9654']

DOI: https://doi.org/10.1109/tit.2021.3097965